The Orthogonal Subcategory Problem and the Small Object Argument

A classical result of P. Freyd and M. Kelly states that in “good” categories, the Orthogonal Subcategory Problem has a positive solution for all classes of morphisms whose members are, except possibly for a subset, epimorphisms. We prove that under the same assumptions on the base category and on , the generalization of the Small Object Argument of D. Quillen holds—that is, every object of the category has a cellular -injective weak reflection. In locally presentable categories, we prove a sharper result: a class of morphisms is called quasi-presentable if for some cardinal λ every member of the class is either λ-presentable or an epimorphism. Both the Orthogonal Subcategory Problem and the Small Object Argument are valid for quasi-presentable classes. Surprisingly, in locally ranked categories (used previously to generalize Quillen’s result), this is no longer true: we present a class of morphisms, all but one being epimorphisms, such that the orthogonality subcategory is not reflective and the injectivity subcategory Inj is not weakly reflective. We also prove that in locally presentable categories, the injectivity logic and the Orthogonality Logic are complete for all quasi-presentable classes. Financial support by Centre for Mathematics of University of Coimbra and by School of Technology of Viseu is acknowledged by the third author.     

Enumerating typical abelian prime-fold coverings of a circulant graph

Enumerating the isomorphism classes of several types of graph coverings is one of the central research topics in enumerative topological graph theory (see [R. Feng, J.H. Kwak, J. Kim, J. Lee, Isomorphism classes of concrete graph coverings, SIAM J. Discrete Math. 11 (1998) 265-272; R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73-85; R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196-207; SIAM J. Discrete Math. 21 (2007) 548-550 (erratum); M. Hofmeister, Graph covering projections arising from finite vector spaces over finite fields, Discrete Math. 143 (1995) 87-97; M. Hofmeister, Enumeration of concrete regular covering projections, SIAM J. Discrete Math. 8 (1995) 51-61; M. Hofmeister, A note on counting connected graph covering projections, SIAM J. Discrete Math. 11 (1998) 286-292; J.H. Kwak, J. Chun, J. Lee, Enumeration of regular graph coverings having finite abelian covering transformation groups, SIAM J. Discrete Math. 11 (1998) 273-285; J.H. Kwak, J. Lee, Isomorphism classes of graph bundles, Canad. J. Math. XLII (1990) 747-761]). A covering is called abelian (or circulant, respectively) if its covering graph is a Cayley graph on an abelian (or a cyclic, respectively) group. A covering p from a Cayley graph onto another Cay (Q,Y) is called typical if the map p:A→Q on the vertex sets is a group epimorphism. Recently, the isomorphism classes of connected typical circulant r-fold coverings of a circulant graph are enumerated in [R. Feng, J.H. Kwak, Typical circulant double coverings of a circulant graph, Discrete Math. 277 (2004) 73-85] for r=2 and in [R. Feng, J.H. Kwak, Y.S. Kwon, Enumerating typical circulant covering projections onto a circulant graph, SIAM J. Discrete Math. 19 (2005) 196-207; SIAM J. Discrete Math. 21 (2007) 548-550 (erratum)] for any r. As a continuation of these works, we enumerate in this paper the isomorphism classes of typical abelian prime-fold coverings of a circulant graph.     

Saturated packings and reduced coverings obtained by perturbing tilings

Let a normed space X possess a tiling T consisting of unit balls. We show that any packing P of X obtained by a small perturbation of T is completely translatively saturated; that is, one cannot replace finitely many elements of P by a larger number of unit balls such that the resulting arrangement is still a packing.In contrast with that, given a tiling T of Rⁿ with images of a convex body C under Euclidean isometries, there may exist packings P consisting of isometric images of C obtained from T by arbitrarily small perturbations which are no longer completely saturated. This means that there exists some positive integer k such that one can replace k−1 members of P by k isometric copies of C without violating the packing property. However, we quantify a tradeoff between the size of the perturbation and the minimal k such that the above phenomenon occurs.Analogous results are obtained for coverings.     

The nonidealness index of rank-ideal matrices

A polyhedron is integral if all its extreme points have 0, 1 components and in this case the matrix M is called ideal. When Q has fractional extreme points, there are different ways of classifying how far M is away from being ideal, through the polyhedral structure of Q. In this sense, Argiroffo, Bianchi and Nasini (2006) [1] defined a nonidealness index analogous to an imperfection index due to Gerke and McDiarmid (2001) [10].In this work we determine the nonidealness index of rank-ideal matrices (introduced by the authors (2008)). It is known that evaluating this index is NP-hard for any matrix. We provide a tractable way of evaluating it for most circulant matrices, whose blockers are a particular class of rank-ideal matrices, thereby following similar lines as done for the imperfection ratio of webs due to Coulonges, Pêcher and Wagler (2009) [7].Finally, exploiting the properties of this nonidealness index, we identify the facets of the set covering polyhedron of circulant matrices, having maximum strength with respect to the linear relaxation, according to a measure defined by Goemans (1995) [9].     

On the density of 2‐colorable 3‐graphs in which any four points span at most two edges

Let ex₂(n, K) be the maximum number of edges in a 2‐colorable K‐free 3‐graph (where K={123, 124, 134} ). The 2‐chromatic Turán density of K is $\pi_{2}({K}_{4}^-) =lim_{{n}\to \infty} {ex}_{2}({n}, {K}_{4}^-)/\left(_{3}^{n}\right)Let ex₂(n, K) be the maximum number of edges in a 2‐colorable K‐free 3‐graph (where K={123, 124, 134} ). The 2‐chromatic Turán density of K is $\pi_{2}({K}_{4}^-) =lim_{{n}\to \infty} {ex}_{2}({n}, {K}_{4}^-)/\left(_{3}^{n}\right)$. We improve the previously best known lower and upper bounds of 0.25682 and 3/10?ε, respectively, by showing that This implies the following new upper bound for the Turán density of K In order to establish these results we use a combination of the properties of computer‐generated extremal 3‐graphs for small n and an argument based on “super‐saturation”. Our computer results determine the exact values of ex(n, K) for n≤19 and ex₂(n, K) for n≤17, as well as the sets of extremal 3‐graphs for those n. © 2009 Wiley Periodicals, Inc. J Combin Designs 18: 105–114, 2010     

Applications of Bernstein-Durrmeyer operators in estimating the covering number

The paper deals with estimates of the covering number for some Mercer kernel Hilbert space with Bernstein-Durrmeyer operators. We first give estimates of l2-norm of Mercer kernel matrices reproducing by the kernels K(α,β)(x,y):=∞∑k=0 C(α,β)k Qk(α,β)(x)Qk(α,β)(y),where Qα,βk(x) are the Jacobi polynomials of order k on (0, 1), Cα,βk > 0 are real numbers,and from which give the lower and upper bounds of the covering number for some particular reproducing kernel Hilbert space reproduced by K(α,β)(x,y).     

Symmetrically approximately continuous functions, consistent density theorems, and Fubini type inequalities

Using the continuum hypothesis, Sierpinski constructed a nonmeasurable function such that is countable for every Clearly, such a function is symmetrically approximately continuous everywhere.

Here we to show that Sierpinski's example cannot be constructed in ZFC. Moreover, we show it is consistent with ZFC that if a function is symmetrically approximately continuous almost everywhere, then it is measurable.

     

Locating Active Sensors on Traffic Networks

Sensors are used to monitor traffic in networks. For example, in transportation networks, they may be used to measure traffic volumes on given arcs and paths of the network. This paper refers to an active sensor when it reads identifications of vehicles, including their routes in the network, that the vehicles actively provide when they use the network. On the other hand, the conventional inductance loop detectors are passive sensors that mostly count vehicles at points in a network to obtain traffic volumes (e.g., vehicles per hour) on a lane or road of the network.This paper introduces a new set of network location problems that determine where to locate active sensors in order to monitor or manage particular classes of identified traffic streams. In particular, it focuses on the development of two generic locational decision models for active sensors, which seek to answer these questions: (1) “How many and where should such sensors be located to obtain sufficient information on flow volumes on specified paths?”, and (2) “Given that the traffic management planners have already located count detectors on some network arcs, how many and where should active sensors be located to get the maximum information on flow volumes on specified paths?”The problem is formulated and analyzed for three different scenarios depending on whether there are already count detectors on arcs and if so, whether all the arcs or a fraction of them have them. Location of an active sensor results in a set of linear equations in path flow variables, whose solution provide the path flows. The general problem, which is related to the set-covering problem, is shown to be NP-Hard, but special cases are devised, where an arc may carry only two routes, that are shown to be polynomially solvable. New graph theoretic models and theorems are obtained for the latter cases, including the introduction of the generalized edge-covering by nodes problem on the path intersection graph for these special cases. An exact algorithm for the special cases and an approximate one for the general case are presented.     

The illumination conjecture and its extensions

Summary The Illumination Conjecture was raised independently by Boltyanski and Hadwiger in 1960. According to this conjecture any <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>d$-dimensional convex body can be illuminated by at most $2^d$ light sources. This is an important fundamental problem. The paper surveys the state of the art of the Illumination Conjecture.     

Covering the crosspolytope by equal balls

Summary We determine the minimal radius of <InlineEquation ID=IE"1"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"2"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"3"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"4"><EquationSource Format="TEX"><![CDATA[<InlineEquation ID=IE"5"><EquationSource Format="TEX"><![CDATA[$]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>]]></EquationSource></InlineEquation>n=2$, $d$ or $2d$ congruent balls, which cover the $d$-dimensional crosspolytope.